Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space
نویسندگان
چکیده
One of most famous theorems in computational geometry is the duality between Voronoi diagram and Delaunay triangulation in Euclidean space. This paper proposes an extension of that theorem to the Voronoi diagram and Delaunay-type triangulation in dually at space. In that space, the Voronoi diagram and the triangulation can be computed e ciently by using potential functions. We also propose higher-order Voronoi diagrams and prove that Delaunay-type triangulation is as good in dually at space as it is in Euclidean space.
منابع مشابه
Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams
The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This struc...
متن کاملAn obstruction to Delaunay triangulations in Riemannian manifolds
Delaunay has shown that the Delaunay complex of a finite set of points P of Euclidean space R triangulates the convex hull of P , provided that P satisfies a mild genericity property. Voronoi diagrams and Delaunay complexes can be defined for arbitrary Riemannian manifolds. However, Delaunay’s genericity assumption no longer guarantees that the Delaunay complex will yield a triangulation; stron...
متن کاملVoronoi Diagrams and Delaunay Triangulations
The Voronoi diagram of a set of sites partitions space into regions one per site the region for a site s consists of all points closer to s than to any other site The dual of the Voronoi diagram the Delaunay triangulation is the unique triangulation so that the circumsphere of every triangle contains no sites in its interior Voronoi diagrams and Delaunay triangulations have been rediscovered or...
متن کاملOn Voronoi-Delaunay Duality and Delaunay Meshes
In this paper, we are concerned with Delaunay triangulations of the vertex set of a piecewise flat (pwf) surface. We first propose the notion of well-formed Voronoi diagrams and establish a precise dual relationship between them and proper Delaunay triangulations on pwf surfaces. Then we provide an algorithm which, given any input manifold triangle mesh, constructs aDelaunay mesh: a manifold tr...
متن کاملComputation of Tunnels in Protein Molecules using Delaunay Triangulation
This paper presents a new method of specific cavity analysis in protein molecules. Long-term biochemical research has the discovery that protein molecule behaviour depends on the existence of cavities (tunnels) leading from the inside of the molecule to its surface. Previous methods of tunnel computation were based on space rasterization. Our approach is based on computational geometry and uses...
متن کامل